翻訳と辞書 |
Santa Fe Trail problem : ウィキペディア英語版 | Santa Fe Trail problem The Santa Fe Trail problem is a Genetic programming exercise in which Artificial ants search for food pellets according to a programmed set of instructions.〔Koza, John R., ''Genetic Programming: On the Programming of Computers by Means of Natural Selection''. MIT Press, Cambridge, MA. 1992. pp. 147-155. Print.〕〔(The Artificial Ant Problem )〕 The layout of food pellets in the Santa Fe Trail problem has become a standard for comparing different genetic programming algorithms and solutions. One method for programming and testing algorithms on the Santa Fe Trail problem is by using the NetLogo application.〔(NetLogo )〕 There is at least one case of a student creating a Lego robotic ant to solve the problem.〔(Romero's Pilgrimage to Santa Fe: A Tale of Robot Evolution )〕 ==See also==
* Genetic programming * Agent-based model * Java Grammatical Evolution
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Santa Fe Trail problem」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|